More about operator order preserving

نویسندگان

چکیده

It is well known that increasing functions do not preserve operator order in general; nor decreasing reverse order. However, monotone or do. In this article, we employ a convex approach to discuss preserving conversing functions. As an easy consequence of more general results, find nonnegative constants γ and ψ such A≤B implies f(B)≤f(A)+γ1ℋ andf(A)≤f(B)+ψ1ℋ, for the self-adjoint operators A, B on Hilbert space ℋ with identity 1ℋ function f whose domain contains spectra both A B. The connection these results existing literature will be discussed significance emphasized by some examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes

Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching: for a given text the goal is to find its factors having the same “shape” as a given pattern. The known results include a linear-time algorithm for this problem (in case of polynomially-bounded alphabet) and a generalization to multiple patterns. We exte...

متن کامل

Order Preserving Key Compression

Order preserving data compression can improve sorting and searching performance, and hence the performance of database systems. We describe a new parsing (tokenization) technique that can be effectively applied to "keys", producing substantial compression. It can be applied to both the uncompressed and compressed strings, permiting a more flexible choice of variable length dictionary entries an...

متن کامل

Order-Preserving Symmetric Encryption

We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD ’04) for allowing efficient range queries on encrypted data. Interestingly, we first show that a straightforward relaxation of standard security notions for encryption such as indistinguishability against chosen-plaintext attack (IND-CPA) ...

متن کامل

Order-preserving matching

We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders coincide with those of the pattern. Order-preserving matching is applicable to many scenarios such as stock price analysis and musical melody matching in which the order relations should be matched instead of the str...

متن کامل

Semi-order preserving encryption

Order preserving encryption (OPE) is a kind of encryption designed to support searches on ciphertexts. OPE encrypts plaintexts to ciphertexts with the same order, making it possible to efficiently compare ciphertexts without decryption. Because of its efficiency, OPE has been used in systems aimed at practical use. However, even though many OPE schemes have been proposed, all suffer from securi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 2021

ISSN: ['0035-7596', '1945-3795']

DOI: https://doi.org/10.1216/rmj.2021.51.1691